Algebraic properties of space-time block codes in intersymbol interference multiple-access channels

In this paper, we study the multiple-access channel where users employ space–time block codes (STBC). The problem is formulated in the context of an intersymbol interference (ISI) multiple-access channel which occurs for transmission over frequency-selective channels. The algebraic structure of the STBC is utilized to design joint interference suppression, equalization, and decoding schemes. Each of the users transmits using = 2 transmit antennas and a time-reversed STBC suitable for frequency-selective channels. We first show that a diversity order of 2 ( + 1) is achievable at full transmission rate for each user, when we have receive antennas, channel memory of , and an optimal multiuser maximum-likelihood (ML) decoder is used. Due to the decoding complexity of the ML detector we study the algebraic structure of linear multiuser detectors which utilize the properties of the STBC. We do this both in the transform (D-domain) formulation and when we impose finite block-length constraints (matrix formulation). The receiver is designed to utilize the algebraic structure of the codes in order to preserve the block quaternionic structure of the equivalent channel for each user. We also explore some algebraic properties of D-domain quaternionic matrices and of quaternionic block circulant matrices that arise in this study.